A METHOD OF TERMINATING ASYNCHRONOUS ITERATIVE ALGORITHMS ON MESSAGE PASSING SYSTEMS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Byzantine consensus in asynchronous message-passing systems: a survey

Consensus is a classical distributed systems problem with both theoretical and practical interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the implementation of highlyresilient computing services. This paper surveys Byzantine consensus in message-passing distributed systems, by presenting the main theoretical results in the area, the main classes of algor...

متن کامل

Equations for Asynchronous Message Passing

In [Cza 2006] fix-point equations specifying synchronous (”hand-shaking”) communication in distributed systems have been proposed. Their solution yielded a communication network of agents, directly presented as a Petri net-like structure, and determined the global state of the specified system. The net-places represented agents, while transitions transfer of messages. A special algebra being a ...

متن کامل

Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems

A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory task-performing algorithms on asynchronous message-passing processors with quantifiable message latency. Efficiency is measured in terms of work...

متن کامل

Implementing Shared Registers in Asynchronous Message-Passing Systems

A distributed system is comprised of a collection of n processes which communicate with one another. Two means of interprocess communication have been heavily studied. Message-passing systems model computer networks where each process can send information over message channels to other processes. In shared-memory systems, processes communicate less directly by accessing information in shared da...

متن کامل

Iterative Detection and Decoding for MIMO Systems with Knowledge-Aided Message Passing Algorithms

In this paper, we consider the problem of iterative detection and decoding (IDD) for multi-antenna systems using low-density parity-check (LDPC) codes. The proposed IDD system consists of a soft-input soft-output parallel interference (PIC) cancellation scheme with linear minimum mean-square error (MMSE) receive filters and two novel belief propagation (BP) decoding algorithms. The proposed BP ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Parallel Algorithms and Applications

سال: 1996

ISSN: 1063-7192

DOI: 10.1080/10637199608915571